Coping with Indefinite and Negative Data in Deductive Databases: A Survey
نویسندگان
چکیده
[Jo93a] C. A. Johnson, Top down deduction in indefinite deductive databases, Keele University technical report (TR93-08).
منابع مشابه
Semantic foundations for the view update problem
We present a declarative framework for updating views over indefinite databases, that is, databases with null values. The framework follows the standard database approach, which allows for a unique null constant. As the main contributions of the paper, we introduce the concept of an indefinite deductive database as a formal representation of a view over an indefinite database, propose a semanti...
متن کاملIndefinite and GCWA Inference in Indefinite Deductive Databases
This paper presents several basic results on compiling indefinite and GCWA(Generalized Closed World Assumption) inference in IDDB(Indefinite Dedutive Databases). We do not allow function symbols, but do allow non-Horn clauses. Further, although the GCWA is used to derive negative assumptions, we do also allow negative clauses to occur explicitly. We show a fundamental relationship between indef...
متن کاملThe View-Update Problem for Indefinite Databases
This paper introduces and studies a declarative framework for updating views over indefinite databases. An indefinite database is a database with null values that are represented, following the standard database approach, by a single null constant. The paper formalizes views over such databases as indefinite deductive databases, and defines for them several classes of database repairs that real...
متن کاملQuerying and Updating Constraint Databases with Incomplete Information
It is the aim of the research described in this paper is to to extend the work to deductive databases by proposing a theory of indefinite deductive constraint databases (IDCDs). This model provides a useful and natural representation of partial and infinite information. As a result of basing our representation of incomplete information on constraints, we can easily extend our model in order to ...
متن کاملA Minimal-Model Based Horizontal Fragmentation Algorithm for Disjunctive Deductive Databases
Disjunctive deductive databases (DDDBs) capture indefinite information, i.e., imprecise or partial knowledge of the real world, and are more general than definite deductive databases that can only represent unconditionally true facts. Formal approaches for fragmenting a DDDB, with a view to distribute the DDDB and then design a query optimization strategy for the distributed DDDB, are lacking. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Data Knowl. Eng.
دوره 2 شماره
صفحات -
تاریخ انتشار 1987